Kneser graphs are like Swiss cheese
نویسندگان
چکیده
We prove that for a large family of product graphs, and for Kneser graphs K(n, αn) with fixed α < 1/2, the following holds. Any set of vertices that spans a small proportion of the edges in the graph can be made independent by removing a small proportion of the vertices of the graph. This allows us to strengthen the results of [DFR08] and [DF09], and show that any independent set in these graphs is almost contained in an independent set which depends on few coordinates. Our proof is inspired by, and follows some of the main ideas of Fox’s proof of the graph removal lemma [Fox11].
منابع مشابه
Bipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کاملShifts of the stable Kneser graphs and hom-idempotence
A graph G is said to be hom-idempotent if there is a homomorphism from G2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from Gn+1 to Gn. Larose et al. (1998) proved that Kneser graphs KG(n, k) are not weakly hom-idempotent for n ≥ 2k + 1, k ≥ 2. For s ≥ 2, we characterize all the shifts (i.e., automorphisms of the graph that map every vertex to one of its neighbors) ...
متن کاملSymmetries of the Stable Kneser Graphs
It is well known that the automorphism group of the Kneser graph KGn,k is the symmetric group on n letters. For n ≥ 2k + 1, k ≥ 2, we prove that the automorphism group of the stable Kneser graph SGn,k is the dihedral group of order 2n. Let [n] := [1, 2, 3, . . . , n]. For each n ≥ 2k, n, k ∈ {1, 2, 3, . . .}, the Kneser graph KGn,k has as vertices the k-subsets of [n] with edges defined by disj...
متن کاملColorful subgraphs in Kneser-like graphs
Combining Ky Fan’s theorem with ideas of Greene and Matoušek we prove a generalization of Dol’nikov’s theorem. Using another variant of the Borsuk-Ulam theorem due to Bacon and Tucker, we also prove the presence of all possible completely multicolored t-vertex complete bipartite graphs in t-colored t-chromatic Kneser graphs and in several of their relatives. In particular, this implies a genera...
متن کاملRandom Kneser graphs and hypergraphs
A Kneser graph KGn,k is a graph whose vertices are all k-element subsets of [n], with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lovász states that the chromatic number of a Kneser graph KGn,k is equal to n − 2k + 2. In this paper we discuss the chromatic number of random Kneser graphs and hypergraphs. It was studied in two recent paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017